Unitary Unification of S 5 Modal Logic and Its Extensions
نویسنده
چکیده
It is shown that all extensions of S5 modal logic, both in the standard formalization and in the formalization with strict implication, as well as all varieties of monadic algebras have unitary unification.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملThe Focused Constraint Inverse Method for Intuitionistic Modal Logics
We present a focused inverse method for proof search in a variety of intuitionistic modal logics such as K, D, T, S4 and S5. Unification of worldpaths for such logics is non-unitary and therefore handled by adding constraints to sequents. We sketch proofs of soundness and completeness with respect to intuitionistic modal natural deduction and describe our implementation. Potential applications ...
متن کاملTransparent Unifiers in Modal Logics with Self-conjugate Operators
It is shown that weakly transitive normal modal logics containing D : ♦>, with (definable) self-conjugate operators in the sense of Jonsson and Tarski have transparent unifiers, hence, unitary unification. There are continuummany such logics. Transparent unifiers are given in a simple explicit form. In logics with transparent unifiers every admissible rule with unifiable premises is derivable, ...
متن کاملUnification in the normal modal logic Alt1
The unification problem in a logical system L can be defined in the following way: given a formula φ(x1, . . . , xα), determine whether there exists formulas ψ1, . . ., ψα such that φ(ψ1, . . . , ψα) is in L. The research on unification for modal logics was originally motivated by the admissibility problem for rules of inference: given a rule of inference φ1(x1, . . . , xα), . . . , φm(x1, . . ...
متن کاملRules with parameters in modal logic I
We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameterfree admissibility and unification to the setting with parameters. Specifically, we give a characterization of projective formulas generalizing Ghilardi’s characterization in the parameter-free case, leading to new proof...
متن کامل